The Number of Maximal Independent Sets in the Pm-extended of Graphs
نویسندگان
چکیده
منابع مشابه
determination of maximal singularity free zones in the workspace of parallel manipulator
due to the limiting workspace of parallel manipulator and regarding to finding the trajectory planning of singularity free at workspace is difficult, so finding a best solution that can develop a technique to determine the singularity-free zones in the workspace of parallel manipulators is highly important. in this thesis a simple and new technique are presented to determine the maximal singula...
15 صفحه اولIntegers for the Number of Maximal Independent Sets in Graphs
Let G be a simple undirected graph. Denote by mi(G) (respectively, xi(G)) the number of maximal (respectively, maximum) independent sets in G. In this paper we determine the third and fouth largest value of mi(G) among all graphs of order n. Moreover, the extremal graphs achieving these values are also determined. Mathematics Subject Classification: 05C35, 05C69, 68R10
متن کاملon the number of maximum independent sets of graphs
let $g$ be a simple graph. an independent set is a set ofpairwise non-adjacent vertices. the number of vertices in a maximum independent set of $g$ isdenoted by $alpha(g)$. in this paper, we characterize graphs $g$ with $n$ vertices and with maximumnumber of maximum independent sets provided that $alpha(g)leq 2$ or $alpha(g)geq n-3$.
متن کاملromantic education:reading william wordsworths the prelude in the light of the history of ideas
عصر روشنگری زمان شکل گیری ایده های مدرن تربیتی- آموزشی بود اما تاکید بیش از اندازه ی دوشاخه مهم فلسفی زمان یعنی عقل گرایی و حس گرایی بر دقت و وضوح، انسان عصر روشنگری را نسبت به دیگر تواناییهایش نابینا کرده و موجب به وجود آمدن افرادی تک بعدی شد که افتخارعقلانیتشان، تاکید شان بر تجربه فردی، به مبارزه طلبیدن منطق نیاکانشان وافسون زدایی شان از دنیا وتمام آنچه با حواس پنجگانه قابل درک نبوده و یا در ...
Graphs with the second largest number of maximal independent sets
Let G be a simple undirected graph. Denote by mi(G) (respectively, xi(G)) the number of maximal (respectively, maximum) independent sets in G. Erdős and Moser raised the problem of determining the maximum value of mi(G) among all graphs of order n and the extremal graphs achieving this maximum value. This problem was solved by Moon and Moser. Then it was studied for many special classes of grap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Computer Science and Engineering
سال: 2020
ISSN: 2475-8841
DOI: 10.12783/dtcse/cmso2019/33625